Superdirective Robust Algorithms’ Comparison for Linear Arrays
نویسندگان
چکیده
منابع مشابه
Towards Superdirective Beamforming with Loudspeaker Arrays
ABSTRACT In this paper, the superdirective beamforming principle as applied to loudspeaker arrays is investigated. Novel superdirectional beamformer designs (e.g. by Parra, [1]) offer significant spatial selectivity at low frequencies and allow for a small array aperture and some variability in loudspeaker positioning. The theoretical gains of superdirectional beamforming are generally difficul...
متن کاملSome Linear-Time Algorithms for Systolic Arrays
We survey some recent results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of O(n) cells; similarly for the GCD of two n-bit binary numbers. We show how n by n Toeplitz systems of linear equations can be solved in time O(n) on ...
متن کاملPlanar superdirective microphone arrays for speech acquisition in the car
In this paper we investigate a small broadside planar (2D) superdirective microphone array for speech acquisition in the car and compare its performance to linear arrays. The objective of this investigation is to replace an expensive directional microphone by a small array of inexpensive omnidirectional sensors. Since the array was designed to be used in the car environment it has to satisfy re...
متن کاملPattern synthesis method applied in designing HF superdirective receive arrays
Low side lobe level (SLL) and forming nulls can help to realize high-frequency (HF) superdirective receive arrays. In this letter, we reformulate the problem of designing an HF superdirective receive array as a problem of pattern synthesis. Based on the adaptive array theory, we present a numerical pattern synthesis algorithm combined with the design of HF superdirective receive array. Compared...
متن کاملEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acoustics
سال: 2020
ISSN: 2624-599X
DOI: 10.3390/acoustics2030038